An agent-based optimisation approach for vehicle routing problem with unique vehicle location and depot

The Vehicle Routing Problem (VRP) is a well studied logistical problem along with its various variants such as VRP customer Time-Window (VRPTW). However, all the previously assume that vehicles are mostly same in terms of their capacity, location and home (depot). This study uses agent-based approach for solving VRPTW vehicle’s unique depot. to minimise number used main target. Other targets including total distance travelled, waiting time also considered criteria evaluate quality generated vehicle routes. achieved by proposing Messaging Protocol-based Heuristics Optimisation (MPHO) model balances between centrally-distributed agents’ interactions accommodates certain priority rules specifically developed problem. Furthermore, modifications constraints checking techniques introduced implementing Push Forward (PF) recursively tailored route’s start/ending locations calculating reduced find check limit route duration. In order justify superiority proposed MPHO model, numerical tests have been conducted on benchmark problems single multiple depot instances modified made possible randomising vehicles’ capacities depots. Key results reveal that, instances, higher solutions compared previous outcomes obtained minimising fastest solution (CPU) at expense travelled.